Traversing the Topical Landscape

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traversing the landscape of experimental power ∗

We present an overview of the use of power calculations in experimental economics as well as other disciplines. We review the methodology proposed by the field of economics as well the pitfalls in failing to incorporate power calculations in lab and field experiments. We write this note to further draw attention to the issue, and to make a case that details of power calculations should be repor...

متن کامل

Exploring, tailoring, and traversing the solution landscape of a phase-shaped CARS process.

Pulse shaping techniques are used to improve the selectivity of broadband CARS experiments, and to reject the overwhelming background. Knowledge about the fitness landscape and the capability of tailoring it is crucial for both fundamental insight and performing an efficient optimization of phase shapes. We use an evolutionary algorithm to find the optimal spectral phase of the broadband pump a...

متن کامل

Traversing the Machining Graph

Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag machining path for a given pocket (i.e., a planar domain). We give an optimal linear time dynamic programming algorithm for simply connected pockets, and a linear plus O(1) time optimal algorithm for pockets with h holes. If the...

متن کامل

Memory Formation: Traversing the Highwire

Molecules that suppress memory formation protect against the consolidation of inaccurate information. A recent study in Drosophila has identified a new pathway for memory suppression and the neurons that are a gateway to long-term memory formation.

متن کامل

Traversing Directed Eulerian Mazes

The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are called exits. Each of the algorithms puts in one of the exits of each vertex a scan pebble. These pebble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Written Communication

سال: 1989

ISSN: 0741-0883,1552-8472

DOI: 10.1177/0741088389006003001